Gcd Matrices, Posets, and Nonintersecting Paths
نویسندگان
چکیده
We show that with any finite partially ordered set, P , one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is proved combinatorially using nonintersecting paths in a directed graph.
منابع مشابه
On the Relationship between Graphs and Totally Positive Matrices
A real matrix is said to be totally positive if all its minors are nonnegative. In this paper it is shown that properties of totally positive matrices can be applied to graph theory, and conversely. In fact, some properties of undirected and directed graphs (digraphs) are characterized in terms of the associated totally positive matrices. Some results on the existence of nonintersecting paths i...
متن کاملCounting Nonintersecting Lattice Paths with Turns
We derive enumeration formulas for families of nonintersecting lattice paths with given starting and end points and a given total number of North-East turns. These formulas are important for the computation of Hilbert series for determinantal and pfaffian rings.
متن کاملA Remarkable Formula for Counting Nonintersecting Lattice Paths in a Ladder with Respect to Turns
We prove a formula, conjectured by Conca and Herzog, for the number of all families of nonintersecting lattice paths with certain starting and end points in a region that is bounded by an upper ladder. Thus we are able to compute explicitly the Hilbert series for certain one-sided ladder determinantal rings.
متن کاملOn Total Positivity of Catalan-Stieltjes Matrices
Recently Chen-Liang-Wang (Linear Algebra Appl. 471 (2015) 383–393) present some sufficient conditions for the total positivity of Catalan-Stieltjes matrices. Our aim is to provide a combinatorial interpretation of their sufficient conditions. More precisely, for any Catalan-Stieltjes matrix A we construct a digraph with a weight, which is positive under their sufficient conditions, such that ev...
متن کاملViewing Determinants as Nonintersecting Lattice Paths yields Classical Determinantal Identities Bijectively
In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindström–Gessel–Viennotmethod and the Jacobi-Trudi identity together with elementary observations. After some preparations, this point of view provides “graphical proofs” for classical determinantal identities like the Cauchy-Binet formula, Dodgson’s condensation fo...
متن کامل